Rewriting Techniques in Finitely Presented Groups
نویسنده
چکیده
This document contains an ampliied version of the ve talks given by the author at the 22nd Holiday Mathematics Symposium at the New Mexico State University, January 3-7 1997, on the topic \Rewriting Techniques and Non-commutative Grr obner Bases".
منابع مشابه
Reconfigurable Systems and Intractability
Ghrist and Peterson [4] have investigated the properties of a certain general class of reconfigurable systems, with an eye to practical application. We show that in the general case, these reconfigurable systems are powerful enough to represent the rewriting rules of finitely presented groups, and therefore fall prey to the existence of finitely presented groups with unsolvable word problem.
متن کاملTame filling invariants for groups
A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and extrinsic diameter functions for finitely presented groups. We show that the existence of a (finite-valued) tame filling function implies that the group is tame...
متن کاملFinitely presented monoids with linear Dehn function need not have regular cross-sections
This paper shows that a finitely presented monoid with linear Dehn function need not have a regular cross-section, strengthening the previously-known result that such a monoid need not be presented by a finite complete string rewriting system, and contrasting the fact that finitely presented groups with linear Dehn function always have regular cross-sections.
متن کاملOn Groups Presented by Monadic Rewriting Systems with Generators of Finite Order
We prove that the groups presented by finite convergent monadic rewriting systems with generators of finite order are exactly the free products of finitely many finite groups, thereby confirming Gilman’s Conjecture in a special case. We also prove that the finite cyclic groups of order at least three are the only finite groups admitting a presentation by more than one finite convergent monadic ...
متن کاملEffective JSJ Decompositions
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko’s decompositi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997